An Embryonics Implementation of a Self-Replicating Universal Turing Machine
نویسندگان
چکیده
The goal of this contribution is to describe how a universal Turing machine was embedded into a hardware system in order to verify the computational universality of a novel architecture. This implementation was realized with a multicellular automaton inspired by the embryonic development of living organisms. In such an architecture, every artificial “cell” contains a complete copy of the description of the machine, a redundancy that allows the introduction of the properties of self-repair and self-replication. These properties were coupled with a modified version of the W-machine to realize a robust, self-replicating universal computer in actual hardware.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملA semantic virtual machine
A semantic virtual machine (SVM) is a variant of a programable register machine that combines the transparency and simplicity of the action of a Turing machine with a clearly arranged assembler-style programming language and a user-friendly representation of semantic information. This paper describes the concept of the SVM, its memory management and flow control, and shows how a semantic virtua...
متن کاملVon Neumann’s Machine in the Shell: Enhancing the Robustness of Self-Replication Processes
One of the grand challenges in artificial life is to create an artificial system that demonstrates self-replication and evolution in the real physical world (Bedau et al. 2000). This question was obviously initiated by von Neumann’s seminal work on the self-replicating and evolving automaton that was presented more than five decades ago (von Neumann 1951; 1966). Unlike his well known idea of un...
متن کاملSelf-replicating loop with universal construction
After a survey of the theory and some realizations of self-replicating machines, this paper presents a novel self-replicating loop endowed with universal construction properties. Based on the hardware implementation of the so-called Tom Thumb algorithm, the design of this loop leads to a new kind of cellular automaton made of a processing and a control units. The self-replication of the “LSL” a...
متن کاملBlueprint for Self-replicating and Self-assembling 3D Printers
In the 1940s Stanislaw Ulam and John Von Neumann came up with the idea of cellular Automata (CAs), which Von Neumann later used to develop a universal constructor (Neumann, 1966). The universal constructor is a pattern implemented in a CA that consists of a two parts: The universal constructor and a tape. The universal constructor reads from the tape and produces what is encoded. A universal co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001